By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Scientific Computing

Table of Contents
Search This Issue
Volume 14, Issue 5, pp. 1013-1257

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

Fast Iterative Solvers for Toeplitz-Plus-Band Systems

Raymond H. Chan and Kwok-Po Ng

pp. 1013-1019

BibTeX  Abstract Full Text:  PDF

Variants of BICGSTAB for Matrices with Complex Spectrum

Martin H. Gutknecht

pp. 1020-1033

BibTeX  Abstract Full Text:  PDF

Block Sparse Cholesky Algorithms on Advanced Uniprocessor Computers

Esmond G. Ng and Barry W. Peyton

pp. 1034-1056

BibTeX  Abstract Full Text:  PDF

A Monotone Petrov–Galerkin Method for Quasilinear Parabolic Differential Equations

Øistein Bøe

pp. 1057-1071

BibTeX  Abstract Full Text:  PDF

Multilevel Iteration for Mixed Finite Element Systems with Penalty

Zhiqiang Cai, Charles I. Goldstein, and Joseph E. Pasciak

pp. 1072-1088

BibTeX  Abstract Full Text:  PDF

On a Multivariate Eigenvalue Problem, Part I: Algebraic Theory and a Power Method

Moody T. Chu and J. Loren Watterson

pp. 1089-1106

BibTeX  Abstract Full Text:  PDF

High-Order and Efficient Methods for the Vorticity Formulation of the Euler Equations

J. S. Lowengrub, M. J. Shelley, and B. Merriman

pp. 1107-1142

BibTeX  Abstract Full Text:  PDF

Hypercube Algorithms for Direct N-Body Solvers for Different Granularities

Jean-Philippe Brunet, Jill P. Mesirov, and Alan Edelman

pp. 1143-1158

BibTeX  Abstract Full Text:  PDF

Analysis of the Multigrid FMV Cycle on Large-Scale Parallel Machines

Ray S. Tuminaro and David E. Womble

pp. 1159-1173

BibTeX  Abstract Full Text:  PDF

Fast Inverse $QR$ Factorization for Toeplitz Matrices

James G. Nagy

pp. 1174-1193

BibTeX  Abstract Full Text:  PDF

Using Implicit ODE Methods with Iterative Linear Equation Solvers in Spectral Methods

Ivar Lie

pp. 1194-1213

BibTeX  Abstract Full Text:  PDF

Methods for Reducing Approximate-Factorization Errors in Two- and Three-Factored Schemes

Erlendur Steinthorsson and Tom I-P. Shih

pp. 1214-1236

BibTeX  Abstract Full Text:  PDF

High-Order Symplectic Runge–Kutta–Nyström Methods

M. P. Calvo and J. M. Sanz-Serna

pp. 1237-1252

BibTeX  Abstract Full Text:  PDF

A Mapping Algorithm for Parallel Sparse Cholesky Factorization

Alex Pothen and Chunguang Sun

pp. 1253-1257

BibTeX  Abstract Full Text:  PDF